Reachability solution characterization of parametric real-time systems
نویسندگان
چکیده
منابع مشابه
Real-time control with parametric timed reachability games
Timed game automata are used for solving control problems on real-time systems. A timed reachability game consists in finding a strategy for the controller for the system, modeled as a timed automaton. Such a controller says when and which of some "controllable" actions should be taken in order to reach "goal" states. We deal with a parametric version of timed game automata. We define parametri...
متن کاملReachability analysis of real-time systems using time Petri nets
Time Petri nets (TPNs) are a popular Petri net model for specification and verification of real-time systems. A fundamental and most widely applied method for analyzing Petri nets is reachability analysis. The existing technique for reachability analysis of TPNs, however, is not suitable for timing property verification because one cannot derive end-to-end delay in task execution, an important ...
متن کاملParametric Optimization of Open Real-Time Systems
For controllable timed automata, a general parametric optimization framework based on automatatheory is proposed. The framework is general enough to incorporate both the parametric analysis problem and the controller synthesis problem of computer systems. We propose an algorithm for the construction of the characterization of the parameter constraints and controller synthesis, which in turn yie...
متن کاملParametric Timing Analysis for Real-Time Systems
We extend a TCTL model-checking problem to a parametric timing analysis problem for real-time systems and develop new techniques for solving it. The algorithm we present here accepts timed transition system descriptions and parametric TCTL formulas with timing parameter variables of unknown sizes and can give back general linear equations of timing parameter variables whose solutions make the s...
متن کاملReal Solution Classification for Parametric Semi-Algebraic Systems
Real solution classification of parametric polynomial systems is a crucial problem in real quantifier elimination which interests Volker Weispfenning and others. In this paper, we present a stepwise refinement algorithm for real solution classifications of a class of parametric systems consisting of polynomial equations, inequalities and inequations. For an input system, the algorithm outputs t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.07.014